Spectral Characterization of the Hamming Graphs
نویسندگان
چکیده
منابع مشابه
on the skew spectral moments of graphs
let $g$ be a simple graph, and $g^{sigma}$ be an oriented graph of $g$ with the orientation $sigma$ and skew-adjacency matrix $s(g^{sigma})$. the $k-$th skew spectral moment of $g^{sigma}$, denoted by $t_k(g^{sigma})$, is defined as $sum_{i=1}^{n}( lambda_{i})^{k}$, where $lambda_{1}, lambda_{2},cdots, lambda_{n}$ are the eigenvalues of $g^{sigma}$. suppose $g^{sigma...
متن کاملThe competition numbers of ternary Hamming graphs
The competition graph of a digraph D is a graph which has the same vertex set as D and has an edge between x and y if and only if there exists a vertex v in D such that (x, v) and (y, v) are arcs of D. For any graph G, G together with sufficiently many isolated vertices is the competition graph of some acyclic digraph. The competition number k(G) of a graph G is defined to be the smallest numbe...
متن کاملCharacterizing subgraphs of Hamming graphs
Cartesian products of complete graphs are known as Hamming graphs. Using embeddings into Cartesian products of quotient graphs we characterize subgraphs, induced subgraphs, and isometric subgraphs of Hamming graphs. For instance, a graph G is an induced subgraph of a Hamming graph if and only if there exists a labeling of E(G) fulfilling the following two conditions: (i) incident edges receive ...
متن کاملSpectral characterization of graphs with index
A graph is said to be determined by the adjacency spectrum (DS for short) if there is no other nonisomorphic graph with the same spectrum. All connected graphs with index at most √ 2 + √ 5 are known. In this paper, we show that with few exceptions all of these graphs are DS. AMS Subject Classification: 05C50.
متن کاملSpectral Characterization of Generalized Cocktail-Party Graphs
In the paper, we prove that all generalized cocktail-party graphs with order at least 23 are determined by their adjacency spectra.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2007
ISSN: 1556-5068
DOI: 10.2139/ssrn.1025398